All Questions
4 questions
8votes
3answers
2kviews
A* (shortest path) with the ability to remove up to one wall
Problem You are given an HxW matrix. Each element is either 0 (passable space) or 1 (wall). Given that you can remove one wall, find the shortest path from [0,0] (start) to [width-1, height-1] (end). ...
- 183
2votes
0answers
229views
Codewars: Remote Control Virtual Keyboard
This is my solution to the Codewars problem TV Remote (symbols). Description In short, you are given a virtual keyboard with 3 modes between which can be switched by pressing the ...
- 21
4votes
1answer
142views
Path Finder Maze
The goal of my code was to find all possible moves from each open position in the maze (@moves_hash), assign it a value for how many moves it would take to get to ...
11votes
1answer
6kviews
Find the shortest path through a maze with a twist: you can knock down one wall
I would like my solution to Google Foobar's prepare_the_bunnies_escape checked for readability, maintainability, extensibility, style, design. I am looking forward ...
- 167
